package org.zxp.datastructure.tree;

/**
 * @program: effectiveJava
 * @description: 链表二叉树数据结构
 * @author: X-Pacific zhang
 * @create: 2019-08-02 16:00
 **/
public class LinkedTree {
    private String value;
    private int vInt;
    private LinkedTree right;
    private LinkedTree left;

    public LinkedTree(String value) {
        this.value = value;
    }


    public LinkedTree(int vInt) {
        this.vInt = vInt;
    }

    public String getValue() {
        return value;
    }

    public void setValue(String value) {
        this.value = value;
    }

    public LinkedTree getRight() {
        return right;
    }

    public void setRight(LinkedTree right) {
        this.right = right;
    }

    public LinkedTree getLeft() {
        return left;
    }

    public void setLeft(LinkedTree left) {
        this.left = left;
    }

    public int getvInt() {
        return vInt;
    }

    public void setvInt(int vInt) {
        this.vInt = vInt;
    }

    @Override
    public String toString() {
        return "LinkedTree{" +
                "value='" + value + '\'' +
                ", vInt=" + vInt +
                ", right=" + right +
                ", left=" + left +
                '}';
    }
}
